Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021

In the Proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference ( IPCO

We consider the scheduling problem of minimizing a weighted sum of completion times under release dates. We present a relaxation which is a supermodular polyhedron. We show that this relaxation is precisely the projection of a time-indexed relaxation introduced by Dyer and Wolsey.

Combinatorial Optimization and Integer Programming

Short contents list

Combinatorial Optimization and Integer Linear Programming Combinatorial Optimization

Examples: Shortest Path, Traveling Salesman, and many many more. . . Just in bioinformatics: Alignments, Threading, Clone-Probe Mapping, Probe Selection, De Novo Peptide Sequencing, SideChain Placement, Maximum-weight Connected Subgraph in PPI Networks, Genome Rearrangements, Cluster Editing, Finding Regulatory Modules, Finding Approximate Gene Clusters, Haplotyping, and many more. . . Example....

Combinatorial Optimization and Integer Linear Programming

Examples: Shortest Path, Traveling Salesman, and many many more. . . Just in bioinformatics: Alignments, Threading, Clone-Probe Mapping, Probe Selection, De Novo Peptide Sequencing, SideChain Placement, Maximum-weight Connected Subgraph in PPI Networks, Genome Rearrangements, Cluster Editing, Finding Regulatory Modules, Finding Approximate Gene Clusters, Haplotyping, and many more. . . Example....

Integer and combinatorial optimization